Fully Secure Predicate - based Broadcast Encryption ?
نویسندگان
چکیده
According to the broadcast encryption scheme with wide applications in the real world, a fully secure predicate-based broadcast encryption was proposed by combining with Waters dual system encryption, predicate encryption and the orthogonality property of composite-order bilinear groups. Based on the standard model, the scheme can achieve constant-size key and ciphertext, and guarantee the security of the plaintext M as well as the security of the attribute vectors. The scheme is proved by using the three static assumptions. Furthermore, the analysis results indicated that the scheme of this paper is fully secure and can satisfy the higher efficiency and practice requirement.
منابع مشابه
Design and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملOn Black-Box Constructions of Predicate Encryption from Trapdoor Permutations
Predicate encryption is a recent generalization of identitybased encryption (IBE), broadcast encryption, attribute-based encryption, and more. A natural question is whether there exist black-box constructions of predicate encryption based on generic building blocks, e.g., trapdoor permutations. Boneh et al. (FOCS 2008) recently gave a negative answer for the specific case of IBE. We show both n...
متن کاملTracing Insider Attacks in the Context of Predicate Encryption Schemes
In a predicate encryption scheme an authority generates master public and secret keys, and uses the master secret key to derive personal secret keys for authorized users. Each user’s personal secret key SKf corresponds to a predicate f defining the access rights of that user, and each ciphertext is associated (by the sender) with an attribute. The security provided is that a ciphertext associat...
متن کاملConstruction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes
This paper presents a new framework for constructing fully CCA-secure predicate encryption schemes from pair encoding schemes. Our construction is the first in the context of predicate encryption which uses the technique of well-formedness proofs known from public key encryption. The resulting constructions are simpler and more efficient compared to the schemes achieved using known generic tran...
متن کاملOn the Power of Pair Encodings: Frameworks for Predicate Cryptographic Primitives
Recently Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) secure predicate encryption (PE) based on a new primitive, called pair encodings. The author shows that if the underlying pair encoding scheme is either perfectly secure or computationally (doubly-selectively) secure, then the PE scheme will be fully secure. Although the pair encodings were solely introduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014